Constraint Satisfaction In "Conscious" Software Agents--A Practical Application

نویسندگان

  • Arpad Kelemen
  • Stan Franklin
  • Yulan Liang
چکیده

The U.S. Navy has been trying for many years to automate its personnel assignment process. Periodic assignment of personnel to new jobs is mandatory according to Navy policy. Though various software systems are used regularly, the process is still mainly done manually and sequentially by Navy personnel, called detailers. This paper is a case study in applying cognitive theories implemented via new AI techniques to produce flexible adaptive human-like software. In it we present a sketch of an Intelligent Distribution Agent that aims to largely automate the detailer's tasks. In particular, we look inside its constraint satisfaction, which is mainly responsible for satisfying the requirements of the Navy's policies, the command's needs and the sailor's preferences in order to achieve " satisfactory " job assignments according to ever evolving Navy standards.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Constraints for Large-Scale Scheduling Problems

Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed models may reduce the exponential complexity by partitioning the problem into a set of subproblems. In this work, we present a distributed model for solving large-scale CSPs in which agents are committed to sets of con...

متن کامل

Toward a General Language for the Specification of Constraint Satisfaction Problems

The past decade saw rapid progress toward prominence of constraint satisfaction technology. Many practical algorithms have been developed to solve larger and larger problems. The degree of maturity in this technology begs the support of well-established software engineering tools. This paper targets a formal specification language DEPICT 0.1 that can aid in the formulation of constraint satisfa...

متن کامل

Constraint Satisfaction Techniques and Software Agents

Although constraint satisfaction techniques and agent technology have been combined in several ways, especially over the last few years, it is still debated how, beyond ad hoc approaches, these two computational paradigms can be effectively integrated. The aim of this paper is to analyze and discuss how constraint satisfaction techniques can be used to engineer agents’ reasoning and resolve coo...

متن کامل

Constraint Satisfaction Techniques for Negotiating Agents

This paper discusses the deployment of constraint satisfaction methods as a way of enforcing the coordination of distinct and selfinterested agents in open and dynamic environments. We report back on our experience in deploying such approach for developing an agent based solution for resource allocation in multi-provider communication networks. This makes it possible to draw some conclusions on...

متن کامل

Plan recognition in exploratory domains

This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for effective plan recognition in such settings. In exploratory domains, agents’ actions map onto logs of behavior that include switching between activities, extraneous actions, and mistakes. Flexible pedagogical software, suc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Artificial Intelligence

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2005